منابع مشابه
Neuro-fuzzy based constraint programming
Constraint programmingmodels appear inmany sciences includingmathematics, engineering and physics. These problems aim at optimizing a cost function joint with some constraints. Fuzzy constraint programming has been developed for treating uncertainty in the setting of optimization problems with vague constraints. In this paper, a new method is presented into creation fuzzy concept for set of con...
متن کاملdesigning unmanned aerial vehicle based on neuro-fuzzy systems
در این پایان نامه، کنترل نرو-فازی در پرنده هدایت پذیر از دور (پهپاد) استفاده شده است ابتدا در روش پیشنهادی اول، کنترل کننده نرو-فازی توسط مجموعه اطلاعات یک کنترل کننده pid به صورت off-line آموزش دیده است و در روش دوم یک کنترل کننده نرو-فازی on-line مبتنی بر شناسایی سیستم توسط شبکه عصبی rbf پیشنهاد شده است. سپس کاربرد این کنترل کننده در پهپاد بررسی شده است و مقایسه ای ما بین کنترل کننده های معمو...
Fuzzy Project Scheduling Using Constraint Programming
The paper aims to present an application of constraint programming techniques for project portfolio scheduling taking into account the imprecision in activity duration and cost. Data specification in the form of discrete α-cuts allows combining distinct and imprecise data, and implementing a constraint satisfaction problem with the use of constraint programming. Moreover using α-cuts, optimisti...
متن کاملRule-Based Constraint Programming
In this paper we present a view of constraint programming based on the notion of rewriting controlled by strategies. We argue that this concept allows us to describe in a uniied way the constraint solving mechanism as well as the metalanguage needed to manipulate the constraints. This has the advantage to provide descriptions that are very close to the proof theoretical setting used now to desc...
متن کاملConstraint - Based Reasoning and Constraint Programming 182
We show the equivalence between the so-called DavisPutnam procedure [3, 2] and the Forward Checking of Haralick and Elliot [7]. Both apply the paradigm choose and propagate in two different formalisms, namely the propositional calculus and the constraint satisfaction problems formalism. They happen to be strictly equivalent as soon as a compatible instantiation order is chosen. This equivalence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2010
ISSN: 0307-904X
DOI: 10.1016/j.apm.2010.03.005